Weights in Codes and Genus 2 Curves
نویسندگان
چکیده
We discuss a class of binary cyclic codes and their dual codes. The minimum distance is determined using algebraic geometry, and an application of Weil’s theorem. We relate the weights appearing in the dual codes to the number of rational points on a family of genus 2 curves over a finite field.
منابع مشابه
One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملQuadratic Forms, Generalized Hamming Weights of Codes and Curves with Many Points
In the interaction between algebraic geometry and classical coding theory the correspondence between words in trace codes C and Artin Schreier curves over finite fields is a central theme. This correspondence can be extended to a relation between subcodes of C and fibre products of Artin Schreier curves. As a consequence weights of words and subcodes are related to numbers of rational points on...
متن کاملHow to Construct Curves Over Finite Fields With Many Points
This bound was proved for elliptic curves by Hasse in 1933. Ever since, the question of the maximum number Nq(g) of points on an irreducible curve of genus g over a finite field of cardinality q could have been investigated. But for a long time it attracted no attention and it was only after Goppa introduced geometric codes in 1980 that this question aroused systematic attention, cf. [G], [M], ...
متن کاملCodes from Jacobian surfaces
This paper is concerned with some Algebraic Geometry codes on Jacobians of genus 2 curves. We derive a lower bound for the minimum distance of these codes from an upper “Weil type” bound for the number of rational points on irreducible (possibly singular or non-absolutely irreducible) curves lying on an abelian surface over a finite field.
متن کاملQuantum codes from algebraic curves with automorphisms
Let X be an algebraic curve of genus g > 2 defined over a field Fq of characteristic p > 0. From X , under certain conditions, we can construct an algebraic geometry code C. If the code C is self-orthogonal under the symplectic product then we can construct a quantum code Q, called a QAG-code. In this paper we study the construction of such codes from curves with automorphisms and the relation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003